Перевод: с английского на русский

с русского на английский

fault graph

См. также в других словарях:

  • Fault-tolerant computer systems — are systems designed around the concepts of fault tolerance. In essence, they have to be able to keep working to a level of satisfaction in the presence of faults. Types of fault tolerance Most fault tolerant computer systems are designed to be… …   Wikipedia

  • Hypohamiltonian graph — In the mathematical field of graph theory, a graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian.HistoryHypohamiltonian graphs were first… …   Wikipedia

  • List of graph theory topics — This is a list of graph theory topics, by Wikipedia page. See glossary of graph theory for basic terminology Contents 1 Examples and types of graphs 2 Graph coloring 3 Paths and cycles 4 …   Wikipedia

  • Odd graph — The Petersen graph as an odd graph O3 Vertices Edges …   Wikipedia

  • Kautz graph — Sample of K. graph with M=2: on the left N=1, on the right N=2.The edges of the left graph correspond to the nodes of right graph.The Kautz graph K M^{N + 1} is a directed graph of degree M and dimension N+1, which has (M +1)M^{N} vertices… …   Wikipedia

  • Montereau-Fault-Yonne — For other uses, see Montereau (disambiguation). Montereau Fault Yonne Bridges over rivers Seine (foreground), Yonne (background) and statue of Napoléon …   Wikipedia

  • график интенсивности отказов — — [http://slovarionline.ru/anglo russkiy slovar neftegazovoy promyishlennosti/] Тематики нефтегазовая промышленность EN failure graphfailure plotfault graphhazard rate plot …   Справочник технического переводчика

  • Global serializability — In concurrency control of databases, transaction processing (transaction management), and other transactional distributed applications, Global serializability (or Modular serializability) is a property of a global schedule of transactions. A… …   Wikipedia

  • List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… …   Wikipedia

  • Liste De Problèmes NP-Complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive …   Wikipédia en Français

  • Liste de problemes NP-complets — Liste de problèmes NP complets Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets,… …   Wikipédia en Français

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»